Improved Approximation Algorithms for Label Cover Problems
نویسندگان
چکیده
منابع مشابه
Improved Approximation Algorithms for Connected Sensor Cover
Wireless sensor networks have recently posed many new system building challenges. One of the main problems is energy conservation since most of the sensors are devices with limited battery life and it is infeasible to replenish energy via replacing batteries. An effective approach for energy conservation is scheduling sleep intervals for some sensors, while the remaining sensors stay active pro...
متن کاملApproximation Algorithms for Label Cover and The Log-Density Threshold
Many known optimal NP-hardness of approximation results are reductions from a problem called LabelCover. The input is a bipartite graph G = (L,R,E) and each edge e = (x, y) ∈ E carries a projection πe that maps labels to x to labels to y. The objective is to find a labeling of the vertices that satisfies as many of the projections as possible. It is believed that the best approximation ratio ef...
متن کاملApproximation Algorithms for the Label-CoverMAX and Red-Blue Set Cover Problems
This paper presents approximation algorithms for two extensions of the set cover problem: a graph-based extension known as the Max-Rep or Label-CoverMAXproblem, and a color-based extension known as the Red-Blue Set Cover problem. First, a randomized algorithm guaranteeing approximation ratio √ n with high probability is proposed for the Max-Rep (or Label-CoverMAX) problem, where n is the number...
متن کاملImproved Approximation Algorithms for Unsplittable Flow Problems
In the single-source unsplittable ow problem we are given a graph G; a source vertex s and a set of sinks t 1 ; : : :; t k with associated demands. We seek a single s-t i ow path for each commodity i so that the demands are satissed and the total ow routed across any edge e is bounded by its capacity c e : The problem is an NP-hard variant of max ow and a generalization of single-source edge-di...
متن کاملImproved Approximation Algorithms for Balanced Partitioning Problems
We present approximation algorithms for balanced partitioning problems. These problems are notoriously hard and we present new bicriteria approximation algorithms, that approximate the optimal cost and relax the balance constraint. In the first scenario, we consider Min-Max k-Partitioning, the problem of dividing a graph into k equal-sized parts while minimizing the maximum cost of edges cut by...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2011
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-010-9464-3